منابع مشابه
Limit complexities revisited [once more]
The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin [13] saying that limsupnC(x|n) (here C(x|n) is conditional (plain) Kolmogorov complexity of x when n is known) equals C0 ′ (x), the plain Kolmogorov complexity with 0′-oracle. Then we use the same argument to prove similar resu...
متن کاملPlain stopping time and conditional complexities revisited
In this paper we analyze the notion of “stopping time complexity”, the amount of information needed to specify when to stop while reading an infinite sequence. This notion was introduced by Vovk and Pavlovic [8]. It turns out that plain stopping time complexity of a binary string x could be equivalently defined as (a) the minimal plain complexity of a Turing machine that stops after reading x o...
متن کاملPrefix-Like Complexities and Computability in the Limit
Computability in the limit represents the non-plus-ultra of constructive describability. It is well known that the limit computable functions on naturals are exactly those computable with the oracle for the halting problem. However, prefix (Kolmogorov) complexities defined with respect to these two models may differ. We introduce and compare several natural variations of prefix complexity defin...
متن کاملLimit algebras and integer-valued cocycles, revisited
A triangular limit algebra A is isometrically isomorphic to the tensor algebra of a C∗-correspondence if and only if its fundamental relation R(A) is a tree admitting a Z+0 -valued continuous and coherent cocycle. For triangular limit algebras which are isomorphic to tensor algebras, we give a very concrete description for their defining C∗-correspondence and we show that it forms a complete in...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2009
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-009-9203-9